///////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2007, 2008, 2009
// University of Rochester
// Department of Computer Science
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
//    * Redistributions of source code must retain the above copyright notice,
//      this list of conditions and the following disclaimer.
//
//    * Redistributions in binary form must reproduce the above copyright
//      notice, this list of conditions and the following disclaimer in the
//      documentation and/or other materials provided with the distribution.
//
//    * Neither the name of the University of Rochester nor the names of its
//      contributors may be used to endorse or promote products derived from
//      this software without specific prior written permission.
//
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.

#ifndef LISTOVERWRITER_HPP__
#define LISTOVERWRITER_HPP__

#include <stm/stm.hpp>
#include <iostream>
#include "DList.hpp"

namespace bench
{
  /*** similar to TinySTM LinkedList overwrite benchmark */
  class ListOverwriter : public Benchmark
  {
      int ELEMENTS;
      LinkedList list;
    public:
      ListOverwriter(int elements) : ELEMENTS(elements)
      {
          for (int i = 0; i < ELEMENTS; i++)
              list.insert(i);
      }

      virtual void random_transaction(thread_args_t* args,
                                      unsigned int* seed,
                                      unsigned int val,
                                      int action)
      {
          val %= ELEMENTS;
          if (action < BMCONFIG.lookupPct) {
              list.lookup(val);
          }
          else {
              list.overwrite(val);
          }
      }
      virtual bool sanity_check() const { return true; }
      virtual bool verify(VerifyLevel_t v) { return true; }

  };

} // namespace bench

#endif // LISTOVERWRITER_HPP__
